package LeetCode.month03.day74;
import java.util.List;

/**
 * @author 16778
 * @date 2025/10/14 8:26
 * @description
 */
public class No3349 {
    public boolean hasIncreasingSubarrays(List<Integer> nums, int k) {
        int n = nums.size();
        int precount = 0;
        int count = 1;
        for (int i = 1; i < n; i++) {
            if(nums.get(i)>nums.get(i-1)){
                count++;
                if(count>=2*k) return true;
            }else{
                if(precount>=k&&count>=k) return true;
                precount=count;
                count = 1;
            }
        }
        if(precount>=k&&count>=k) return true;
        return false;
    }
}
